A Fourier-Analytic Approach to List-Decoding for Sparse Random Linear Codes
نویسندگان
چکیده
منابع مشابه
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study the question of linearity testing under non-uniform distributions directly, and give a sufficient criterion for linearity to be tolerantly testable under a given distribution. We show that several natural classes of dist...
متن کاملAdvanced Algorithms December 23 , 2004 Lecture 20 : LT Codes Lecturer : Amin
Random linear fountain codes were introduced in the last lecture as a sparse-graph codes for channels with erasure. It turned out that their encoding and decoding costs were quadratic and cubic in the number of packets encoded. We study Luby Transform (LT) codes in this lecture, pioneered by Michael Luby, that retains the good performance of random linear fountain code, while drastically reduci...
متن کاملRestricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
We prove that a random linear code over Fq, with probability arbitrarily close to 1, is list decodable at radius 1− 1/q− with list size L = O(1/ ) and rate R = Ωq( 2/(log(1/ ))). Up to the polylogarithmic factor in 1/ and constant factors depending on q, this matches the lower bound L = Ωq(1/ ) for the list size and upper bound R = Oq( ) for the rate. Previously only existence (and not abundanc...
متن کاملAverage-radius list-recovery of random linear codes: it really ties the room together
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles of arguments—which each work in their own parameter regimes but not in others—and moreover have left some gaps in our understanding of the list-decodability o...
متن کاملLearning Noisy Characters, Multiplication Codes, and Cryptographic Hardcore Predicates
We present results in cryptography, coding theory and sublinear algorithms. In cryptography, we introduce a unifying framework for proving that a Boolean predicate is hardcore for a one-way function and apply it to a broad family of functions and predicates, showing new hardcore predicates for well known one-way function candidates such as RSA and discrete-log as well as reproving old results i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 98-D شماره
صفحات -
تاریخ انتشار 2015